Teamwise Mean Field Competitions

نویسندگان

چکیده

This paper studies competitions with rank-based reward among a large number of teams. Within each sizable team, we consider mean-field contribution game in which team member contributes to the jump intensity common Poisson project process; across all teams, mean field competition is formulated on rank completion time, namely time process, and paid based its ranking. On layer teamwise game, three optimization problems are introduced when size determined by: (i) manager; (ii) central planner; (iii) members’ voting as partnership. We propose relative performance criteria for share team’s formulate some special cases games games, new literature. In homogeneous parameters, equilibrium control worker or optimal can be computed an explicit manner, allowing us analytically examine impacts model parameters discuss their economic implications. Two numerical examples also presented illustrate parameter dependence comparison between different decision making.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The momentum effect in competitions: field evidence from tennis matches

It is often suggested that there is a psychological advantage to be leading in a competition. It is, however, hard to identify such an effect econometrically. Using a Regression Discontinuity Design over a large dataset of tennis matches (N=634,095) the present paper exploits the randomised variation in first set results that occurs when the first set is decided by a close tie break (N=72,294)....

متن کامل

Discrete mean field games

In this paper we study a mean field model for discrete time, finite number of states, dynamic games. These models arise in situations that involve a very large number of agents moving from state to state according to certain optimality criteria. The mean field approach for optimal control and differential games (continuous state and time) was introduced by Lasry and Lions [LL06a, LL06b, LL07]. ...

متن کامل

Mean-field lattice trees

We introduce a mean-field model of lattice trees based on embeddings into Zd of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model introduced previously by Derbez and Slade, and provides an alternate approach to work of Aldous. The scaling limit of the mean-field model is integrated superBr...

متن کامل

Mean-Field Networks

The mean field algorithm is a widely used approximate inference algorithm for graphical models whose exact inference is intractable. In each iteration of mean field, the approximate marginals for each variable are updated by getting information from the neighbors. This process can be equivalently converted into a feedforward network, with each layer representing one iteration of mean field and ...

متن کامل

A Mean Field Competition

We introduce a mean field game with rank-based reward: competing agents optimize their effort to achieve a goal, are ranked according to their completion time, and paid a reward based on their relative rank. First, we propose a tractable Poissonian model in which we can describe the optimal effort for a given reward scheme. Second, we study the principal–agent problem of designing an optimal re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Optimization

سال: 2021

ISSN: ['0095-4616', '1432-0606']

DOI: https://doi.org/10.1007/s00245-021-09789-1